package DataStuctures.BST;

public class Main {

    public static void main(String[] args) {
        BST_InOrder_Traverse<Integer> bst = new BST_InOrder_Traverse<>();
        int[] nums = {5,3,6,8,4,2};
        for(int num : nums){
            bst.add(num);
        }

        bst.inOrder();
        System.out.println();

        BST_PreOrder_Traverse<Integer> bst2 = new BST_PreOrder_Traverse<>();
        for(int num : nums){
            bst2.add(num);
        }
        bst2.preOrder();
        System.out.println();


        BST_RemoveMaxAndMin<Integer> bst3 = new BST_RemoveMaxAndMin<>();
        for(int num : nums){
            bst3.add(num);
        }
        System.out.println(bst3);

        bst3.remove(1);
        System.out.println(bst3);



    }

}
